Short Discreet Proofs
نویسنده
چکیده
We show how to produce short proofs of theorems such that a distrusting Verifier can be convinced that the theorem is true yet obtains no information about the proof itself. The proofs are non-interactive provided that the quadratic residuosity bit commitment scheme is available to the Prover and Verifier. For typical applications, the proofs are short enough to fit on a floppy disk.
منابع مشابه
Secure sealed-bid online auctions using discreet cryptographic proofs
This work describes the design and implementation of an auction system using secure multiparty computation techniques. Our aim is to produce a system that is practical under actual field constraints on computation, memory, and communication. The underlying protocol is privacy-preserving, that is, the winning bid is determined without information about the losing bids leaking to either the aucti...
متن کاملEffective Class of Discreet Programing Problems
We consider herein a concise view of discreet programming models and methods. There has been conducted the models and methods analysis. On the basis of discreet programming models there has been elaborated and offered a new class of problems, i.e. block-symmetry models and methods of applied tasks statements and solutions. Keywords—Discreet programming, block-symmetry, analysis methods, informa...
متن کاملA practical solution for sealed bid and multi-currency auctions
This paper introduces a sealed bid and multi-currency auction using secure multiparty computation (SMC). Two boolean functions, a comparison and multiplication function, have been designed as required to apply SMC. These functions are applied without revealing any information, not even to trusted third parties such as the auctioneer. A type of Zero Knowledge proof, discreet proof, has been impl...
متن کاملTranslation of Resolution Proofs into Short First-Order Proofs without Choice Axioms
I present a way of generating proofs from resolution proofs containing Skolemization. The resulting proofs are purely first-order, i.e. do not make use of ’choice axioms’, ’satisfiability preserving proof steps’, etc. The resulting firts-order proofs are short, i.e. polynomial in the output of the theorem prover.
متن کاملDiscreet Service Provision in Smart Environments: project overview
IST-DISCREET (Discreet Service Provision in Smart Environments) is an European STREP project, started on December 2005, and being developed in the frame of the sixth program framework (FP6). Goal of this paper is to provide an overview of the main project objectives and of the proposed technical approach. A specific technical solution, namely the pseudonym system proposed in the project, is ill...
متن کامل